Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

Verifying Finite - State Graph Grammars : an Unfolding - Based Approa h ?

Unfolding semantics of graph transformation

Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of (semi-weighted) graph grammars a...

Towards Theorem Proving Graph Grammars using Event-B

Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are complex structures that can be adequately modeled as graphs (possibly with an attribute data part) and in which the behavior involves a large amount of parallelism and can be described as reactions to stimuli that can be observed in the state of the system. The verif...

Towards Unfolding-Based Verification for Graph Transformation Systems

The unfolding semantics of graph transformation systems can represent a basis for their formal verification. For general, possibly infinite-state, graph transformation systems one can construct finite underand overapproximations of the (infinite) unfolding, with arbitrary accuracy. Such approximations can be used to check properties of a graph transformation system, like safety and liveness pro...

Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars

Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...